Virtual Time CSMA: Why Two Clocks Are Better than One

نویسندگان

  • Mart Molle
  • Leonard Kleinrock
چکیده

A new carrier sense multiple access (CShiA) algorithm, called virtual time CSMA, is described and analyzed. This algorithm uses a novel approach to granting access to the shared broadcast channel based on variable-rate clocks. Unlike other CSMA algorithms, the operation of virtual time CSMA reduces to the ideal case in the zero propagation time limit: a work-conserving, first-come first-served M/G/1 queueing system. The algorithm does not appear to be difficult to implement, but offers better throughput-delay performance than existing CSMA algorithms. A simple closed form technique for estimating the mean message delay is presented. This technique is of independent interest because of its applicability to certain " sliding window " tree conflict resolution algorithms. Extensive numerical results for the algorithm are presented, including comparisons with simulation and with other CSMA algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Double Clocks Multi-channel Two-dimensional Probability Csma Based on Binary Tree Conflict Resolution Mechanism

With the rapid development of the communication technology, the increase of the users, more and more multi-task requirements will be presented by users who want to take advantage of the wireless access. It proposed new requirements and challenges for multi-users to share limited spectrum resources and ensure the Quality of Service (QoS) of wireless communication network. Based on the successful...

متن کامل

The Best-E ort Virtual-Time CSMA/CD Protocols for Real-Time Systems

Two clairvoyant virtual-time CSMA/CD protocols for dealing with time-constrained messages are described. A clairvoyant protocol takes into account not only the messages currently available for transmission but also the messages expected to be produced in the future. In the absence of clairvoyancy, the urgent but currently unavailable messages may not be successfully transmitted when they are ac...

متن کامل

The Best-E ort Virtual-Time CSMA/CD Protocols with Run-Time Clairvoyancy Support

Two clairvoyant virtual-time CSMA/CD protocols for dealing with time-constrained messages are described. A clairvoyant protocol has a priori knowledge about messages expected to be produced in the future, so that it can take into account such future messages when it makes a decision for transmission. In the absence of clairvoyancy, some urgent future messages may not be successfully transmitted...

متن کامل

Title Performance analysis of a CDMA ALOHA network with channel

It has been shown in [l] that the throughput-delay performance of a CDMA ALOHA network, where each station is assigned a spreading code so that each effectively has its own ‘virtual channel’, and where channel sensing and collision detection are also used, is much better than that of a simple CSMA-CD network. Such a system, however, is difficult to implement. A simpler system that may provide g...

متن کامل

An Optimal Modification of a Kalman Filter

The purpose of a time scale is to form a virtual clock from an ensemble of physical clocks that are compared with one another at a sequence of dates, where a date is the reading of a clock as determined by counting its oscillations. The virtual clock is defined as an offset from one of the physical clocks, the offset being computed from the comparison measurements by some algorithm. The usual g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 33  شماره 

صفحات  -

تاریخ انتشار 1985